Research on K Maximum Dominant Skyline and E-GA Algorithm Based on Data Stream Environment
نویسندگان
چکیده
منابع مشابه
k-dominant and Extended k-dominant Skyline
Skyline queries have recently attracted a lot of attention for its intuitive query formulation. It can act as a filter to discard sub-optimal objects. However, a major drawback of skyline is that, in datasets with many dimensions, the number of skyline objects becomes large and no longer offer any interesting insights. To solve the problem, k-dominant skyline queries have been introduced, which...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملEfficient Reverse Skyline Algorithm for Discovering Top K-dominant Products
Recent boom in internet growth and the advancement in internet security have led to rapid growth in Ecommerce and related services. In this context, capturing the preferences of customers plays an important role in decisions about the design and launch of new products in the market. The science that primarily deals with the support of such decisions is the Operational Research. Since many of th...
متن کاملImage Segmentation Research Based on GA and Improved Otsu Algorithm
In the face of the problem of high complexity of two-dimensional Otsu adaptive threshold algorithm, a new fast and effective Otsu image segmentation algorithm is proposed based on genetic algorithm. This algorithm replaces the segmentation threshold of the traditional two dimensional Otsu method by finding the threshold of two one-dimensional Otsu methods it reduces the computational complexity...
متن کاملResearch on Clustering Algorithm Based on Grid Density on Uncertain Data Stream
To solve the clustering algorithm based on grid density on uncertain data stream in adjustment cycle for clustering omissions, the paper proposed an algorithm, named GCUDS, to cluster uncertain data steam using grid structure. The concept of the data trend degree was defined to describe the grade of a data point belonging to some grid unit and the defect of information loss around grid units wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Systems Science and Engineering
سال: 2018
ISSN: 0267-6192
DOI: 10.32604/csse.2018.33.369